package DataStructure.TreeLearning.MyBSTree;

public class TestDemo {
    public static void main(String[] args) {
        MyBSTreeImp<Integer> tree =  new MyBSTreeImp<>();
        tree.add(5);
        tree.add(5);
        tree.add(2);
        tree.add(3);
        tree.add(0);
        tree.add(-4);
        tree.add(-1);
        tree.add(19);
        tree.add(12);
        tree.add(38);
        System.out.println("PreOrder:");
        System.out.println(tree.preOrder_Stack());
        System.out.println(tree.preOrder_Recursion());
        System.out.println("----------------------------");
        System.out.println("InOrder:");
        System.out.println(tree.inOrder_Stack());
        System.out.println(tree.inOrder_Recursion());
        System.out.println("-----------------------------");
        System.out.println("PostOrder:");
        System.out.println(tree.postOrder_Stack());
        System.out.println(tree.postOrder_Recursion());
        System.out.println("-----------------------------");
        System.out.println(tree.levelOrder_Queue());
    }    
}
